Generalized Convex Disjunctive Programming: Nonlinear Convex Hull Relaxation
نویسندگان
چکیده
منابع مشابه
New Algorithms for Nonlinear Generalized Disjunctive Programming
Generalized Disjunctive Programming (GDP) has been introduced recently as an alternative model to MINLP for representing discrete/continuous optimization problems. The basic idea of GDP consists of representing discrete decisions in the continuous space with disjunctions, and constraints in the discrete space with logic propositions. In this paper, we describe a new convex nonlinear relaxation ...
متن کاملA Global Optimization Algorithm for Nonconvex Generalized Disjunctive Programming and Applications to Process Systems
Abstract A global optimization algorithm for nonconvex Generalized Disjunctive Programming (GDP) problems is proposed in this paper. By making use of convex underestimating functions for bilinear, linear fractional and concave separable functions in the continuous variables, the convex hull of each nonlinear disjunction is constructed. The relaxed convex GDP problem is then solved in the first ...
متن کاملA Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-integer Zero-one Programming Problems
This paper is concerned with the generation of tight equivalent representations for mixedinteger zero-one programming problems. For the linear case, we propose a technique which first converts the problem into a nonlinear, polynomial mixed-integer zero-one problem by multiplying the constraints with some suitable d-degree polynomial factors involving the n binary variables, for any given d E (0...
متن کاملImproved Formulations and Computational Strategies for the Solution and Nonconvex Generalized Disjunctive Programs
Many optimization problems require the modelling of discrete and continuous variables, giving rise to mixed-integer linear and mixed-integer nonlinear programming (MILP / MINLP). An alternative representation of MINLP is Generalized Disjunctive Programming (GDP)1. GDP models are represented through continuous and Boolean variables, and involve algebraic equations, disjunctions, and logic propos...
متن کاملStrong valid inequalities for orthogonal disjunctions and bilinear covering sets
In this paper, we develop a convexification tool that enables the construction of convex hulls for orthogonal disjunctive sets using convex extensions and disjunctive programming techniques. A distinguishing feature of our technique is that, unlike most applications of disjunctive programming, it does not require the introduction of new variables in the relaxation. We develop and apply a toolbo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comp. Opt. and Appl.
دوره 26 شماره
صفحات -
تاریخ انتشار 2003